Browsing by Subject "Term graph rewriting systems"
Now showing items 1-5 of 5
-
Article
Concurrent object-oriented programming using term graph rewriting techniques
(1996)The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent object-oriented programming techniques exploiting the fine grain highly parallel features of TGRS in a ...
-
Conference Object
Essential features of a compiler target language for parallel machines
(IEEE, 1995)Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) ...
-
Article
Experience using an intermediate compiler target language for parallel machines
(1997)The generalised computational model of term graph rewriting systems (TGRSs) has been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional ...
-
Conference Object
Implementing interaction nets in MONSTR
(Association for Computing Machinery, 1997)Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from multiplicative Linear Logic and feature undirected graph edges, while MONSTR arose from the desire ...
-
Conference Object
Term graph rewriting as a specification and implementation framework for concurrent object-oriented programming languages
(IEEE, 1995)The usefulness of the generalized computational model of Term Graph Rewriting Systems (TGRS) for designing and implementing concurrent object-oriented languages, and also for specifying and reasoning about the interaction ...